VLSI Circuit Design of Matrix Transposition Using Tensor Product Formulation

نویسندگان

  • Chin-Yi Tsai
  • Min-Hsuan Fan
  • Chua-Huang Huang
چکیده

Matrix transposition is a simple, but an important computational problem. It explores many key issues on data locality. In this paper, we will design matrix transposition algorithms on various interconnection networks for VLSI circuit design, including omega, baseline and hypercube networks. Since different interconnection networks have their own architectural characteristics and properties, an algorithm needs to be tuned in order to be efficiently implemented on various networks. We use a tensor product based algebraic theory to design matrix transposition algorithms on various interconnection networks. After designing matrix transposition on various interconnection networks, we use a hardware description language, Verilog, to realize algorithms on FPGA. A major goal of this paper is to provide an effective way for designing VLSI circuits of DSP algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

VLSI Circuit Design of Digital Signal Processing Algorithms Using Tensor Product Formulation

Abstract Many important computation problems can be specified by block recursive algorithms. For example, matrix transposition and fast Fourier transform are block recursive algorithms. In this paper, we present a methodology of VLSI circuit design for block recursive algorithms based on the tensor product theory. Matrix transposition and fast Fourier transform algorithms are designed and imple...

متن کامل

Designing Efficient Matrix Transposition on Various Interconnection Networks Using Tensor Product Formulation

Matrix transposition is a simple, but an important computational problem. It explores many key issues on data locality. In this paper, we will design matrix transposition algorithms on various interconnection networks, including omega, baseline and hypercube networks. Since different interconnection networks have their own architectural characteristics and properties, an algorithm needs to be t...

متن کامل

Quantum Gates Revisited: A Tensor Product Based Interpretation Model

Abstract: Quantum computers have been considered as powerful computing apparatus in the future. Various quantum gates and quantum circuits have been presented to solve classical computational problems using quantum mechanical systems. Quantum gates and quantum circuits can be expressed using the tensor product notation. However, the mathematical model of tensor products is usually limited to su...

متن کامل

An Algebraic Theory for Modeling

The theory of tensor products has been used for designing and implementing block recursive numerical algorithms on shared-memory vector multiprocessors such as the Cray-YMP. In this paper, we present an algebraic theory based on tensor products for modeling direct interconnection networks. The development of this model is expected to facilitate the development of a methodology for mapping algor...

متن کامل

Geometric Applications of the Bezout Matrix in the Bivariate Tensor-Product Lagrange basis

Using a new formulation of the Bézout matrix, we construct bivariate matrix polynomials expressed in a tensor-product Lagrange basis. We use these matrix polynomials to solve common tasks in computer-aided geometric design. For example, we show that these bivariate polynomials can serve as stable and efficient implicit representations of plane curves for a variety of curve intersection problems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003